On computational complexity of Siegel Julia sets
نویسندگان
چکیده
It is known that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has polynomial complexity. In this paper we demonstrate the existence of computable quadratic Julia sets whose computational complexity is arbitrarily high.
منابع مشابه
Constructing Locally Connected Non-computable Julia Sets
A locally connected quadratic Siegel Julia set has a simple explicit topological model. Such a set is computable if there exists an algorithm to draw it on a computer screen with an arbitrary resolution. We constructively produce parameter values for Siegel quadratics for which the Julia sets are non-computable, yet locally connected.
متن کاملA computational method for the construction of Siegel sets in complex hyperbolic space
This thesis presents a computational method for constructing Siegel sets for the action of Γ = SU(n,1;O) on HC, where O is the ring of integers of an imaginary quadratic field with trivial class group. The thesis first presents a basic algorithm for computing Siegel sets and then considers practical improvements which can be made to this algorithm in order to decrease computation time. This imp...
متن کاملComputational Complexity of Euclidean Sets : Hyperbolic Julia Sets are Poly - Time Computable
Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable Mark Braverman Master of Science Graduate Department of Computer Science University of Toronto 2004 We investigate different definitions of the computability and complexity of sets in R, and establish new connections between these definitions. This allows us to connect the computability of real functions ...
متن کاملSelf-similarity of Siegel disks and Hausdorff dimension of Julia sets
Let f(z) = ez + z, where θ is an irrational number of bounded type. According to Siegel, f is linearizable on a disk containing the origin. In this paper we show: • the Hausdorff dimension of the Julia set J(f) is strictly less than two; and • if θ is a quadratic irrational (such as the golden mean), then the Siegel disk for f is self-similar about the critical point. In the latter case, we als...
متن کاملSelf-similarity of Siegel Disks and Hausdorr Dimension of Julia Sets
Let f (z) = e 2ii z + z 2 , where is an irrational number of bounded type. According to Siegel, f is linearizable on a disk containing the origin. In this paper we show: the Hausdorr dimension of the Julia set J (f) is strictly less than two; and if is a quadratic irrational (such as the golden mean), then the Siegel disk for f is self-similar about the critical point. In the latter case, we al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/math/0502354 شماره
صفحات -
تاریخ انتشار 2005